import sys, os
import math
TC = False
def solve():
n = int(input())
drinks = ["ABSINTH", "BEER", "BRANDY", "CHAMPAGNE", "GIN", "RUM", "SAKE", "TEQUILA", "VODKA", "WHISKEY", "WINE"]
cnt = 0
for i in range(n):
s = str(input())
if s.isnumeric():
if int(s)<18:
cnt+=1
else:
if s in drinks:
cnt+=1
print(cnt)
if os.path.exists('input.txt'):
debug = True
sys.stdin = open("input.txt","r")
if TC:
for _ in range(int(input())):
solve()
else:
solve()#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
unordered_set<string> s;
s.insert("VODKA");
s.insert("WHISKEY");
s.insert("WINE");
s.insert("TEQUILA");
s.insert("SAKE");
s.insert("RUM");
s.insert("GIN");
s.insert("CHAMPAGNE");
s.insert("BEER");
s.insert("BRANDY");
s.insert("ABSINTH");
int cnt = 0;
while(n--)
{
string str;
cin>>str;
if(!isalpha(str[0]))
{
if(stoi(str) < 18)
{
cnt++;
}
}
else if(s.find(str) != s.end())
{
cnt++;
}
}
cout<<cnt;
return 0;
}1452A - Robot Program | 344A - Magnets |
96A - Football | 702B - Powers of Two |
1036A - Function Height | 443A - Anton and Letters |
1478B - Nezzar and Lucky Number | 228A - Is your horseshoe on the other hoof |
122A - Lucky Division | 1611C - Polycarp Recovers the Permutation |
432A - Choosing Teams | 758A - Holiday Of Equality |
1650C - Weight of the System of Nested Segments | 1097A - Gennady and a Card Game |
248A - Cupboards | 1641A - Great Sequence |
1537A - Arithmetic Array | 1370A - Maximum GCD |
149A - Business trip | 34A - Reconnaissance 2 |
59A - Word | 462B - Appleman and Card Game |
1560C - Infinity Table | 1605C - Dominant Character |
1399A - Remove Smallest | 208A - Dubstep |
1581A - CQXYM Count Permutations | 337A - Puzzles |
495A - Digital Counter | 796A - Buying A House |